numbered undirected graph

См. также в других словарях:

• Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… …   Wikipedia

• Circulant graph — The Paley graph of order 13, an example of a circulant graph. Crown graphs …   Wikipedia

• Dynkin diagram — See also: Coxeter–Dynkin diagram Finite Dynkin diagrams Affine (extended) Dynkin diagrams …   Wikipedia

• Handshaking lemma — In this graph, an even number of vertices (the four vertices numbered 2, 4, 5, and 6) have odd degrees. The sum of the degrees of the vertices is 2 + 3 + 2 + 3 + 3 + 1 = 14, twice the… …   Wikipedia

• Tower of Hanoi — The Tower of Hanoi or Towers of Hanoi (also known as The Towers of Bramha) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks neatly …   Wikipedia

• Floyd–Warshall algorithm — In computer science, the Floyd–Warshall algorithm (sometimes known as the WFI Algorithm or Roy–Floyd algorithm, since Bernard Roy described this algorithm in 1959) is a graph analysis algorithm for finding shortest paths in a weighted, directed… …   Wikipedia

• Polyomino — The 18 one sided pentominoes, including 6 mirrored pairs …   Wikipedia